Probabilistically checkable proof

Results: 138



#Item
131Probabilistic complexity theory / Cryptographic protocols / Computational complexity theory / Randomness / Complexity classes / Salil Vadhan / Zero-knowledge proof / Probabilistically checkable proof / Pseudorandomness / Theoretical computer science / Applied mathematics / Cryptography

Research Statement Salil Vadhan September 2006

Add to Reading List

Source URL: people.seas.harvard.edu

Language: English - Date: 2009-08-20 14:10:08
132Probabilistically checkable proof / Fax / Interrupt flag / Technology / Clinical psychology / Neuropsychology

OUTPATIENT NEUROPSYCHOLOGY REFERRAL FAX TO[removed]Meliss a J e n k i n s, P h.D. Cli n i c a l N e u r o p s y c h o l o g is t

Add to Reading List

Source URL: www.brainworksri.com

Language: English
133Complexity classes / Probabilistic complexity theory / Mathematical optimization / NP-complete problems / Probabilistically checkable proof / NP / PCP theorem / P versus NP problem / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics

Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2013-04-24 07:33:09
134Probabilistic complexity theory / Mathematical optimization / Probabilistically checkable proof / Sanjeev Arora / PCP theorem / Complexity classes / MAX-3SAT / Hardness of approximation / NP / Theoretical computer science / Applied mathematics / Computational complexity theory

Probabilistic Checking of Proofs and Hardness of Approximation Problems

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2005-03-10 11:31:01
135Complexity classes / Probabilistic complexity theory / Mathematical optimization / Mathematical proofs / Interactive proof system / NP / Probabilistically checkable proof / P versus NP problem / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics

Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗

Add to Reading List

Source URL: web.cs.elte.hu

Language: English - Date: 2007-01-10 14:31:22
136Complexity classes / Probabilistic complexity theory / Probabilistically checkable proof / PCP theorem / Mathematical optimization / NP / IP / P / Low / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2008-07-28 11:22:52
137Complexity classes / Probabilistically checkable proof / Interactive proof system / NP / NEXPTIME / P versus NP problem / IP / P / Clique problem / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2008-03-13 15:36:52
138Complexity classes / Mathematical proofs / Probabilistic complexity theory / Mathematical optimization / Interactive proof system / NP / Probabilistically checkable proof / IP / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: groups.csail.mit.edu

Language: English - Date: 2003-04-15 15:57:54
UPDATE